An Operational Semantics for Shared Messaging Communication

نویسنده

  • Astrid Kiehn
چکیده

Shared Messaging Communication (SMC) has been introduced in [8] as a model of communication which reduces communication costs (both in terms of communication latency and memory usage) by allowing tasks to communicate data through special shared memory regions. Sending a reference to an otherwise inaccessible memory regions rather than the data itself, the model combines the advantages of message passing and shared memories. Experimental results have shown that SMC in case of large data payloads clearly outperforms the classical message passing. In this paper we give a formal operational semantics to SMC exhibiting unambiguously the effect of executing an SMC command on local and shared memories. Based on this semantics we show that any program using message passing can be proved to be weakly bisimilar to one based on SMC and that with respect to communication costs the latter is amortised cheaper, [6].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unifying Unified Voice Messaging

Roughly 18 months after installing a unified voice messaging system, we picked it up and merged it into our pre-existing production email domain. This paper deals with both technical aspects deploying a unified messaging system, as well as the cultural shock of merging the very different operational domains of Email support with Telecommunications support into a shared support model. As an adde...

متن کامل

An Operational Semantics for Parallel Execution of Re-entrant PLEX

A large class of legacy software systems, developed and maintained over many years, can also be termed sequential software systems in that independent parts of the system requires exclusive access to shared data during its entire execution. This requirement originates from design decisions on non-preemptive execution, and when the underlying architecture is a single-processor one, this is suffi...

متن کامل

A Process Algebra for Synchronous Concurrent Constraint Programming

Concurrent constraint programming is classically based on asynchronous communication via a shared store. This paper presents new version of the ask and tell primitives which features synchronicity. Our approach is based on the idea of telling new information just in the case that a concurrently running process is asking for it. An operational and an algebraic semantics are deened. The algebraic...

متن کامل

FIPA Agents Messaging grounded on Web Services

Messaging mechanisms for Web Services are tending towards an agent paradigm which is based on very flexible addressing and semantics of messages on top of communication protocols that aim at macro objectives shared by a group of participants. Recent improvements in Web Services make it possible to integrate agents and Web Services in a common messaging framework that includes both architectures...

متن کامل

Semantics of Agent Communication: An Introduction

Communication has been one of the salient issues in the research on concurrent and distributed systems. This holds no less for the research on multiagent systems. Over the last few years the study of agent communication, and in particular the semantics of agent communication, has attracted increased interest. The present paper provides an introduction to this area. Since agent communication bui...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 192  شماره 

صفحات  -

تاریخ انتشار 2007